Contraction of Timetable Networks with Realistic Transfers
نویسنده
چکیده
We successfully contract timetable networks with realistic transfer times. Contraction gradually removes nodes from the graph and adds shortcuts to preserve shortest paths. This reduces query times to 1ms with preprocessing times around 6 minutes on all tested instances. We achieve this by an improved contraction algorithm and by using a station graph model. Every node in our graph has a one-to-one correspondence to a station and every edge has an assigned collection of connections. Our graph model does not need parallel edges. The query algorithm does not compute a single earliest arrival time at a station but a set of arriving connections that allow best transfer opportunities.
منابع مشابه
Contracting Timetable Information Networks
During the last years, impressive progress has been achieved in the field of speed-up techniques for DIJKSTRA’s algorithm. Due to the availability of road networks, most speed-up techniques were developed for such networks. The fastest known techniques use contraction, a procedure that reduces the graph size, in order to gain their impressive speed-ups. However, in a recent work it was observed...
متن کاملA Transit Assignment Model on Stochastic Networks
In this paper, a transit assignment model has been developed on stochastic networks, with considering vehicle capacity and scheduled timetable. The stochastic network based transit assignment model is appropriate to apply for bus and metro networks altogether since it can distinguish between uncertain and reliable travel times characteristics by imposing stochastic parameters on links or lines....
متن کاملTimetable Information: Models and Algorithms
We give an overview of models and efficient algorithms for optimally solving timetable information problems like “given a departure and an arrival station as well as a departure time, which is the connection that arrives as early as possible at the arrival station?” Two main approaches that transform the problems into shortest path problems are reviewed, including issues like the modeling of re...
متن کاملThe multi-objective railway timetable rescheduling problem
Unexpected disruptions occur for many reasons in railway networks and cause delays, cancellations, and, eventually, passenger inconvenience. This research focuses on the railway timetable rescheduling problem from a macroscopic point of view in case of large disruptions. The originality of our approach is to integrate three objectives to generate a disposition timetable: the passenger satisfact...
متن کاملRecovery of disruptions in rapid transit networks
This paper studies the disruption management problem of rapid transit rail networks. Besides optimizing the timetable and the rolling stock schedules, we explicitly deal with the effects of the disruption on the passenger demand. We propose a two-step approach that combines an integrated optimization model (for the timetable and rolling stock) with a model for the passengers' behavior. We repor...
متن کامل